The timetable-based assignment is characterized by the following features.
- Using the Branch & Bound option (Connection search using Branch and Bound), the procedure calculates all suitable connections throughout the entire analysis period. This also includes the calculation of several connections with different impedances (for example shortest time and minimum transfer connections) for a departure time. In the case of a monocriterion shortest path search (Connection search using shortest path search), only one connection is calculated for each departure time, as this reduces the memory and computing time requirements. The search can be influenced by means of the search impedance definition.
- Branch & Bound search is suitable for the analysis of a period - for example the whole day or several hours (Connection search using Branch and Bound). When performing a search at a specific Time (e.g. in the case of a graphical route search), the shortest path search is recommended (Connection search using shortest path search).
- The actual transfer wait time, and thus the coordination of the timetable, is taken into account.
- All indicators in the analyzed time interval can be calculated.
- The decision model for the connection choice (Connection choice) models the actual decision behavior of the passengers realistically, because a passenger usually has some information on the PuT supply (connection search) and then makes his choice from the connections offered (connection choice).
